Exact and Metaheuristic Algorithms for the Urban Transit Routing Problem

The urban transit routing problem (UTRP) consists of finding satisfying routes for public transportation within a city or region. Urban scenarios get bigger and more complex every day, making the design of routes an overwhelming task whose results are often unsatisfactory, with high costs and travel times. We develop an exact MIP formulation and a multi-objective genetic algorithm to solve this problem with higher quality and more efficiently than with current techniques. We benchmark our solutions on generally available real and artificial test cases and achieve better results for all of them.